All $n$-uniform quasitranslation Hjelmslev planes are strongly $n$-uniform
نویسندگان
چکیده
منابع مشابه
Maximal Intersecting Families of Finite Sets and «uniform Hjelmslev Planes
The following theorem is proved. The collection of lines of an n-uniform projective Hjelmslev plane is maximal when considered as a collectiion of mutually intersecting sets of equal cardinality.
متن کاملNew complete 2 - arcs in the uniform projective Hjelmslev planes over chain rings of order 25
In this paper a 2-arc of size 21 in the projective Hjelmslev plane PHG(2,Z25) and a 2-arc of size 22 in PHG(2,F5[X]/(X)) are given. Both arcs are bigger than the 2-arcs previously known in the respective plane. Furthermore, we will give some information on the geometrical structure of the arcs.
متن کاملRegular Hjelmslev Planes . Ii
In this paper we introduce the notion of an «-partition for a Hjelmslev-matrix (//-matrix). This allows us to prove a new composition theorem for //-matrices. We obtain the existence of (/, r)//-matrices and hence of regular (/, ry-H-phaes for infinitely many series of invariants which were not yet known. In fact, many of these invariants were not even known to occur as the invariants of any //...
متن کاملUniform circuits, N Boolean proof nets
The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine the results taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boole...
متن کاملSMALLEST n-UNIFORM HYPERGRAPH WITH POSITIVE DISCREPANCY
A two-coloring of the vertices X of the hypergraph H = ( X , o °) by red and blue has discrepancy d if d is the largest difference between the number of red and blue points in any edge. A two-coloring is an equipartition of H if it has discrepancy 0, i.e., every edge is exactly half red and half blue. Letf(n) be the fewest number of edges in an n-uniform hypergraph (all edges have size n) havin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1975
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1975-0377685-7